Information-Constrained Discrete Choice∗

نویسندگان

  • Lars-Göran Mattsson
  • Mark Voorneveld
  • Jörgen W. Weibull
چکیده

It is not unusual in real-life that one has to choose among finitely many alternatives when the merits of each alternative are not perfectly known. A natural rule is then to choose the alternative which “looks” best. We show that a version of the monotone likelihood ratio property is sufficient, and also essentially necessary, for this decision rule to be optimal. We also analyze how the precision of the decisionmaker’s information affects his or her choice and welfare, and we show that it is not always advantageous to have more choice alternatives. We extend the analysis to situations in which the decision-maker at some cost or effort can choose the precision in his or her information, as well as the number of alternatives to consider. We show that small differences in information cost can result in dramatic differences in choice behaviors. Individuals for whom information gathering is costly will optimally make ill-informed choices. We also show that welfare is not always monotonic in true utilities, both under exogenous and endogenous uncertainty. ∗We thank Carlos Alos-Ferrer and Torbjörn Thedéen for comments to earlier drafts of this manuscript. Mattsson thanks the Swedish Agency for Innovation Systems (VINNOVA) for funding of his research. Voorneveld acknowledges financial support from the European Commision through a Marie Curie Fellowship as well as funding by the Jan Wallander and Tom Hedelius Foundation during the later stages of this project. An early version of this manuscript was presented in November 2002 at CentER at Tilburg University under the title “Probabilistic choice under endogenous uncertainty”.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constrained Non-Renewable Resource Allocation in Metagraphs with Discrete Random ‎Times

In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.The objective of this paper is to maximize the probability of completion of stochastic metagraph before the due date of the proj...

متن کامل

On Rank-Ordered Nested Multinomial Logit Model and D-Optimal Design for this Model

In contrast to the classical discrete choice experiment, the respondent in a rank-order discrete choice experiment, is asked to rank a number of alternatives instead of the preferred one. In this paper, we study the information matrix of a rank order nested multinomial logit model (RO.NMNL) and introduce local D-optimality criterion, then we obtain Locally D-optimal design for RO.NMNL models in...

متن کامل

Probit and nested logit models based on fuzzy measure

Inspired by the interactive discrete choice logit models [Aggarwal, 2019], this paper presents the advanced families of discrete choice models, such as nested logit, mixed logit, and probit models to consider the interaction among the attributes. Besides the DM's attitudinal character is also taken into consideration in the computation of choice probabilities. The proposed choice models make us...

متن کامل

Evaluation of Preferences in Receiving Facilities Using Discrete Choice Experiment Technique

The present study evaluates the effect of some of the most important variables affecting the preferences of bank loan applicants, based on the discrete choice test method. Initially, the variables and their levels were identified after consultation with banking experts and the required information was collected through a questionnaire. The results show that any increase in interest rates, inten...

متن کامل

Hard Instances of the Constrained Discrete Logarithm Problem

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set. Motivated by cryptographic applications, we study sets with succinct representation for which the constrained DLP is hard. We draw on earlier results due...

متن کامل

Focus of Attention: a Challenge on Predicting Constrained Action Hypothesis

Focus of attention instruction has a great influence on performance and learning. The purpose of this study was to examine the predicted constrained action hypothesis in badminton backhand serv. 30 women student participants from physical education classes of University of Kharazmi are selected as sample. Participants are tested in probe task at different stage of serve after identifying base o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004